Simulation of One-Counter Nets via Colouring
نویسندگان
چکیده
Recently, Abdulla and Čerāns (1998) outlined an extensive and involved proof of the decidability of simulation preorder for one-counter nets. In this note, we present a short, complete proof based on simple colourings of the plane.1 1This paper was written during a visit by the first author to Uppsala University supported by a grant from the STINT Fellowship Programme. He is also partially supported by the Grant Agency of the Czech Republic, Grant No. 201/97/0456.
منابع مشابه
On Simulation-Checking with Sequential Systems
We present new complexity results for simulation-checking and modelchecking with infinite-state systems generated by pushdown automata and their proper subclasses of one-counter automata and one-counter nets (one-counter nets are ‘weak’ one-counter automata computationally equivalent to Petri nets with at most one unbounded place). As for simulation-checking, we show the following: a) simulatio...
متن کاملSimulation is Decidable for One-counter Nets
We prove that the simulation preorder is decidable for the class of one-counter nets. A one-counter net consists of a nite-state machine operating on a variable (counter) which ranges over the natural numbers. Each transition can increase or decrease the value of the counter. A transition may not be performed if this implies that the value of the counter becomes negative. The class of one-count...
متن کاملSimulation Over One-counter Nets is PSPACE-Complete
One-counter nets (OCN) are Petri nets with exactly one unbounded place. They are equivalent to a subclass of one-counter automata with just a weak test for zero. Unlike many other semantic equivalences, strong and weak simulation preorder are decidable for OCN, but the computational complexity was an open problem. We show that both strong and weak simulation preorder on OCN are PSPACE-complete....
متن کاملSimulation and Bisimulation over One-Counter Processes
We show an effective construction of (a periodicity description of) the maximal simulation relation for a given one-counter net. Then we demonstrate how to reduce simulation problems over one-counter nets to analogous bisimulation problems over one-counter automata. We use this to demonstrate the decidability of various problems, specifically testing regularity and strong regularity of one-coun...
متن کاملSimulation Problems Over One-Counter Nets
One-counter nets (OCN) are finite automata equipped with a counter that can store non-negative integer values, and that cannot be tested for zero. Equivalently, these are exactly 1-dimensional vector addition systems with states. We show that both strong and weak simulation preorder on OCN are PSPACE-complete.
متن کامل